package leetcode.problems;

import org.junit.Test;

import java.util.Arrays;

/**
 * Created by gmwang on 2018/7/25
 * 岛屿周界
 */
public class _0814NextGreaterElementI {
    /**
     * You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums2.
     * 您得到两个数组（没有重复）nums1和nums2，其中nums1的元素是nums2的子集。
     *
     * 在nums2的对应位置找到nums1元素的所有下一个较大的数字。
     *
     * The Next Greater Number of a number x in nums1 is the first greater number to its right in nums2.
     * If it does not exist, output -1 for this number.
     * nums1的数字X的下一个更大的数是在nums2中右边的第一个较大的数。如果不存在，则输出 -1。
     *
     * Example 1:
     * Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
     * Output: [-1,3,-1]
     * Explanation:
     *     For number 4 in the first array, you cannot find the next greater number for it in the second array, so output -1.
     *     For number 1 in the first array, the next greater number for it in the second array is 3.
     *     For number 2 in the first array, there is no next greater number for it in the second array, so output -1.
     * Example 2:
     * Input: nums1 = [2,4], nums2 = [1,2,3,4].
     * Output: [3,-1]
     * Explanation:
     *     For number 2 in the first array, the next greater number for it in the second array is 3.
     *     For number 4 in the first array, there is no next greater number for it in the second array, so output -1.
     * Note:
     * All elements in nums1 and nums2 are unique.
     * The length of both nums1 and nums2 would not exceed 1000.
     * /**
     *
     * @param nums1,nums2
     * @return
     */
    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
        int [] res = new int [nums1.length];
        outer:for (int i = 0; i < nums1.length; i++) {
        boolean isExist = false;
            res[i] = -1;
            for (int j = 0; j < nums2.length; j++) {
                if(nums2[j] == nums1[i]) isExist = true;
                if(nums2[j] > nums1[i] && isExist) {
                    res[i] = nums2[j];
                    continue outer;
                }
            }
        }
        return res;
    }

//    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
//        Map<Integer, Integer> map = new HashMap<>();
//        int[] result = new int[nums1.length];
//        Deque<Integer> stack = new ArrayDeque<>();
//        for (int num2 : nums2) {
//            while (!stack.isEmpty() && stack.peek() < num2) {
//                map.put(stack.removeFirst(), num2);
//            }
//            stack.addFirst(num2);
//        }
//        for (int i = 0; i < nums1.length; i++) {
//            result[i] = map.getOrDefault(nums1[i], -1);
//        }
//
//        return result;
//    }

    @Test
    public void test() {
//        int[] ints1 = {4,1,2};
//        int[] ints2 = {1,3,4,2};
        int[] ints1 = {2,4};
        int[] ints2 = {1,2,3,4};
        int[] res = nextGreaterElement(ints1,ints2);
        System.out.println(Arrays.toString(res));
    }
}
